K. Döring, M. Erler, S. Schorn, Pseudoplatonica
نویسندگان
چکیده
منابع مشابه
ABS-Type Methods for Solving $m$ Linear Equations in $frac{m}{k}$ Steps for $k=1,2,cdots,m$
The ABS methods, introduced by Abaffy, Broyden and Spedicato, aredirect iteration methods for solving a linear system where the$i$-th iteration satisfies the first $i$ equations, therefore a system of $m$ equations is solved in at most $m$ steps. In thispaper, we introduce a class of ABS-type methods for solving a full rowrank linear equations, w...
متن کاملThe Transient Behavior of the Ph/m/s/k Queue
We analyze the transient behavior of the PH/MI S/K queue. Emphasis is placed on the overflow process, busy period distribution, idle period distribution, accepted arrival process, departure process and the transition probabilities of the system states. All results are represented by the addition and multiplication of the matrices whose dimensions are at most equal to the number of phases for th...
متن کاملS Emantic Network Based M Echanisms for K Nowledge Acquisition
This article summarizes research work started with the SeiPro2S (Semantically Enhanced Intellectual Property Protection System) system designed to protect resources from the unauthorized use of intellectual property. The system implements semantic network as a structure of knowledge representation and a new idea of semantic compression. As the author proved that semantic compression is viable c...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملM . Atapour , S . M . Sheikholeslami and L . Volkmann SIGNED STAR { k } - DOMATIC NUMBER OF A GRAPH
Let G be a simple graph without isolated vertices with vertex set V (G) and edge set E(G) and let k be a positive integer. A function f : E(G) −→ {±1,±2, . . . ,±k} is said to be a signed star {k}-dominating function on G if ∑ e∈E(v) f(e) ≥ k for every vertex v of G, where E(v) = {uv ∈ E(G) | u ∈ N(v)}. The signed star {k}-domination number of a graph G is γ{k}SS(G) = min{ ∑ e∈E f(e) | f is a S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Études platoniciennes
سال: 2008
ISSN: 2275-1785
DOI: 10.4000/etudesplatoniciennes.854